منابع مشابه
Specification and Verification of Synchronizing Concurrent Objects
We introduce a new specification formalism which we call hiddenCCS; hidden algebra is used to specify local goals as objects, and CCS is used to describe global goal of the synchronizing concurrent objects. We extend the object specification with synchronization elements associated with methods of different objects, and we use a CCS coordinating module to describe the interaction patterns of me...
متن کاملAbstracting and Counting Synchronizing Processes
ing and Counting Synchronizing Processes Zeinab Ganjei, Ahmed Rezine, Petru Eles, and Zebo Peng Linköping University, Sweden Abstract. We address the problem of automatically establishing synchronization dependent correctness (e.g. due to using barriers or ensuring absence of deadlocks) of programs generating an arbitrary number of concurrent processes and manipulating variables ranging over an...
متن کاملThe Complexity of Synchronizing Markov Decision Processes
We consider Markov decision processes (MDP) as generators of sequences of probability distributions over states. A probability distribution is psynchronizing if the probability mass is at least p in a single state, or in a given set of states. We consider four temporal synchronizing modes: a sequence of probability distributions is always p-synchronizing, eventually p-synchronizing, weakly psyn...
متن کاملA Fully Parallel Calculus of Synchronizing Processes
We propose a fully parallel calculus of synchronizing processes. The calculus was deeply inspired by LOTOS, of which it inherits multi-party synchronization in process parallel composition. On the other hand, its semantics is not interleaving whereas LOTOS one is. The model we propose is somehow in between Milner's SCCS and ASCCS in that independent actions are performed simultaneously, whereas...
متن کاملSynchronizing Objectives for Markov Decision Processes
We introduce synchronizing objectives for Markov decision processes (MDP). Intuitively, a synchronizing objective requires that eventually, at every step there is a state which concentrates almost all the probability mass. In particular, it implies that the probabilistic system behaves in the long run like a deterministic system: eventually, the current state of the MDP can be identified with a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 1983
ISSN: 0098-5589
DOI: 10.1109/tse.1983.235435